Transformed primal-dual methods for nonlinear saddle point systems
نویسندگان
چکیده
Abstract A transformed primal-dual (TPD) flow is developed for a class of nonlinear smooth saddle point system. The the dual variable contains Schur complement which strongly convex. Exponential stability obtained by showing strong Lyapunov property. Several TPD iterations are derived implicit Euler, explicit implicit-explicit and Gauss-Seidel methods with accelerated overrelaxation flow. Generalized to symmetric iterations, linear convergence rate preserved convex-concave systems under assumptions that regularized functions effectiveness augmented Lagrangian can be explained as regularization non-strongly convexity preconditioning complement. algorithm analysis depends crucially on appropriate inner products spaces primal variable. clear inexact solvers also developed.
منابع مشابه
Adaptive Primal-dual Hybrid Gradient Methods for Saddle-point Problems
The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inp...
متن کاملCommunication-Efficient Distributed Primal-Dual Algorithm for Saddle Point Problem
Primal-dual algorithms, which are proposed to solve reformulated convex-concave saddle point problems, have been proven to be effective for solving a generic class of convex optimization problems, especially when the problems are ill-conditioned. However, the saddle point problem still lacks a distributed optimization framework where primal-dual algorithms can be employed. In this paper, we pro...
متن کاملA primal-dual algorithm framework for convex saddle-point optimization
In this study, we introduce a primal-dual prediction-correction algorithm framework for convex optimization problems with known saddle-point structure. Our unified frame adds the proximal term with a positive definite weighting matrix. Moreover, different proximal parameters in the frame can derive some existing well-known algorithms and yield a class of new primal-dual schemes. We prove the co...
متن کاملPrimal-dual interior-point methods
3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...
متن کاملPrimal–dual Methods for Nonlinear Constrained Optimization
. . . If a function of several variables should be a maximum or minimum and there are between these variables one or several equations, then it will be suffice to add to the proposed function the functions that should be zero, each multiplied by an undetermined quantity, and then to look for the maximum and the minimum as if the variables were independent; the equation that one will find combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Numerical Mathematics
سال: 2023
ISSN: ['1570-2820', '1569-3953']
DOI: https://doi.org/10.1515/jnma-2022-0056